Concerning Abelian-regular transitive triple systems
نویسندگان
چکیده
منابع مشابه
Arc-transitive abelian regular covers of cubic graphs
Quite a lot of attention has been paid recently to the construction of edgeor arc-transitive covers of symmetric graphs. In most cases, the approach has involved voltage graph techniques, which are excellent for finding regular covers in which the group of covering transformations is either cyclic or elementary abelian, or more generally, homocyclic, but are not so easy to use when the covering...
متن کاملArc-transitive abelian regular covers of the Heawood graph
In this sequel to the paper ‘Arc-transitive abelian regular covers of cubic graphs’, all arc-transitive abelian regular covers of the Heawood graph are found. These covers include graphs that are 1-arc-regular, and others that are 4-arc-regular (like the Heawood graph). Remarkably, also some of these covers are 2-arc-regular.
متن کاملResolving Triple Systems into Regular Configurations
A λ − Triple System(v), or a λ–TS(V,B), is a pair (V, B) where V is a set and B is a subset of the 3-subsets of V so that every pair is in exactly λ elements of B. A regular configuration on p points with regularity ρ on l blocks is a pair (P,L) where L is a collection of 3-subsets of a (usually small) set P so that every p in P is in exactly ρ elements of L, and |L| = l. The Pasch configuratio...
متن کاملTransitive Closures of Regular Relations for Verifying Infinite-State Systems
We consider a model for representing innnite-state and para-meterized systems, in which states are represented as strings over a nite alphabet. Actions are transformations on strings, in which the change can be characterized by an arbitrary nite-state transducer. This program model is able to represent programs operating on a variety of data structures, such as queues, stacks, integers, and sys...
متن کاملArc-transitive and s-regular Cayley graphs of valency 5 on Abelian groups
Let G be a finite group, and let 1G 6∈ S ⊆ G. A Cayley di-graph Γ = Cay(G,S) of G relative to S is a di-graph with a vertex set G such that, for x, y ∈ G, the pair (x, y) is an arc if and only if yx−1 ∈ S. Further, if S = S−1 := {s−1|s ∈ S}, then Γ is undirected. Γ is conected if and only if G = 〈s〉. A Cayley (di)graph Γ = Cay(G,S) is called normal if the right regular representation of G is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Annalen
سال: 1898
ISSN: 0025-5831,1432-1807
DOI: 10.1007/bf01448064